Fail-Stop Group Signature Scheme

نویسندگان

چکیده

In this study, a fail-stop group signature scheme (FSGSS) that combines the features of and signatures to enhance security level original is proposed. Assuming FSGSS encounters an attack by hacker armed with supercomputer, can prove digital forged. Based on aforementioned objectives, study proposes three lemmas proves they are indeed feasible. First, how does recipient digitally signed document verify authenticity signature? Second, when under dispute, group’s manager determine identity member who document, if necessary, for investigation? Third, one forged following external from supercomputer? Following attack, could be proved without exposing key. addition, ultimate goal stop using same key immediately after discovery forgery attack; would prevent being repeated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Fail-Stop Signature Scheme Based on Factorization

Fail-stop signature (FSS) schemes protect a signer against a forger with unlimited computational power by enabling the signer to provide a proof of forgery, if it occurs. In this paper, we show a flaw in a previously proposed fail-stop signature that is based on the difficulty of factorization, and then describe a secure scheme based on the same assumption.

متن کامل

A New and Efficient Fail-stop Signature Scheme

Security of ordinary digital signature schemes relies on a computational assumption. Fail-stop signature schemes provide security for a sender against a forger with unlimited computational power by enabling the sender to provide a proof of forgery, if it occurs. In this paper, we give an efficient fail-stop signature scheme that uses two hard problems, discrete logarithm and factorisation, as t...

متن کامل

Fail-stop Designated Recipient Signature Scheme Based on Elliptic Curve Discrete Logarithm Problem

This paper describes a new digital signature called fail-stop designated recipient signature scheme based on elliptic curve discrete logarithm (ECDLP). The scheme allows a signer and an intended recipient to co-operatively provide a proof of forgery if an attacker can successfully forge a signature on a message m. The scheme also provides that the intended recipient is the only entity to verify...

متن کامل

Short fail-stop signature scheme based on factorization and discrete logarithm assumptions

Fail-stop signature (FSS) schemes protect a signer against a forger with unlimited computational power by enabling the signer to provide a proof of forgery, if it occurs. A decade after its invention, there have been several FSS schemes proposed in the literature. Nonetheless, the notion of short FSS scheme has not been addressed yet. Furthermore, the short size in signature schemes has been do...

متن کامل

An Efficient Construction for Fail-Stop Signature for Long Messages

The security of ordinary digital signature schemes relies on a computational assumption. Fail-stop signature (FSS) schemes provide security for a signer against a forger with unlimited computational power by enabling the signer to provide a proof of forgery, if it occurs. Signing long messages using FSS requires a hash function with provable security which results in slow signature generation. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Security and Communication Networks

سال: 2021

ISSN: ['1939-0122', '1939-0114']

DOI: https://doi.org/10.1155/2021/6693726